Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("Distance graph")

Document Type [dt]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Publication Year[py]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Discipline (document) [di]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Author Country

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Results 1 to 25 of 193

  • Page / 8
Export

Selection :

  • and

Planar unit-distance graphs having planar unit-distance complementGERVACIO, Severino V; LIM, Yvette F; MAEHARA, Hiroshi et al.Discrete mathematics. 2008, Vol 308, Num 10, pp 1973-1984, issn 0012-365X, 12 p.Article

Partial cubes are distance graphsGORSE PIHLER, Melita; ZEROVNIK, Janez.Discrete mathematics. 2008, Vol 308, Num 5-6, pp 820-826, issn 0012-365X, 7 p.Conference Paper

The vertex linear arboricity of distance graphsZUO, Lian-Cui; WU, Jia-Liang; LIU, Jia-Zhuang et al.Discrete mathematics. 2006, Vol 306, Num 2, pp 284-289, issn 0012-365X, 6 p.Article

Tree coloring of distance graphs with a real interval setLIANCUI ZUO; QINGLIN YU; JIANLIANG WU et al.Applied mathematics letters. 2006, Vol 19, Num 12, pp 1341-1344, issn 0893-9659, 4 p.Article

Vertex arboricity of integer distance graph G(Dm,k)ZUO, Lian-Cui; QINGLIN YU; WU, Jian-Liang et al.Discrete mathematics. 2009, Vol 309, Num 6, pp 1649-1657, issn 0012-365X, 9 p.Article

Distance graphs with maximum chromatic numberBARAJAS, Javier; SERRA, Oriol.Discrete mathematics. 2008, Vol 308, Num 8, pp 1355-1365, issn 0012-365X, 11 p.Conference Paper

On Hamiltonian paths in distance graphsLÖWENSTEIN, Christian; RAUTENBACH, Dieter; REGEN, Friedrich et al.Applied mathematics letters. 2011, Vol 24, Num 7, pp 1075-1079, issn 0893-9659, 5 p.Article

A survey on labeling graphs with a condition at distance twoYEH, Roger K.Discrete mathematics. 2006, Vol 306, Num 12, pp 1217-1231, issn 0012-365X, 15 p.Article

One-point extensions of generalized hexagons and octagonsCUYPERS, H; DE WISPELAERE, A; VAN MALDEGHEM, H et al.Discrete mathematics. 2009, Vol 309, Num 2, pp 341-353, issn 0012-365X, 13 p.Conference Paper

On strong distances in oriented graphsDANKELMANN, Peter; SWART, Henda C; DAY, David P et al.Discrete mathematics. 2003, Vol 266, Num 1-3, pp 195-201, issn 0012-365X, 7 p.Conference Paper

Extension operations for cutsDEZA, M; LAURENT, M.Discrete mathematics. 1992, Vol 106-7, pp 163-179, issn 0012-365XArticle

Powers of cycles, powers of paths, and distance graphsMIN CHIH LIN; RAUTENBACH, Dieter; JUAN SOULIGNAC, Francisco et al.Discrete applied mathematics. 2011, Vol 159, Num 7, pp 621-627, issn 0166-218X, 7 p.Article

Covering the n-space by convex bodies and its chromatic numberFÜREDI, Z; KANG, J.-H.Discrete mathematics. 2008, Vol 308, Num 19, pp 4495-4500, issn 0012-365X, 6 p.Conference Paper

CIRCULAR COLORING THE PLANEDEVOS, Matt; EBRAHIMI, Javad; CHEBLEH, Mohammad et al.SIAM journal on discrete mathematics (Print). 2008, Vol 21, Num 2, pp 461-465, issn 0895-4801, 5 p.Article

MEAN DISTANCE IN A DIRECTED GRAPH.DOYLE JK; GRAVER JE.1978; ENVIRONMENT AND PLANNG B; GBR; DA. 1978; VOL. 5; NO 1; PP. 19-29; BIBL. 5 REF.Article

On the extremal graphs with respect to the vertex PI indexILIC, Aleksandar.Applied mathematics letters. 2010, Vol 23, Num 10, pp 1213-1217, issn 0893-9659, 5 p.Article

Average distance in graphs and eigenvaluesSIVASUBRAMANIAN, Sivaramakrishnan.Discrete mathematics. 2009, Vol 309, Num 10, pp 3458-3462, issn 0012-365X, 5 p.Article

Bipartite almost distance-hereditary graphsAÏDER, Méziane.Discrete mathematics. 2008, Vol 308, Num 5-6, pp 865-871, issn 0012-365X, 7 p.Conference Paper

The L(2, 1)-labeling on planar graphsZHENDONG SHAO; YEH, Roger K.Applied mathematics letters. 2007, Vol 20, Num 2, pp 222-226, issn 0893-9659, 5 p.Article

Almost distance-hereditary graphsAÏDER, Méziane.Discrete mathematics. 2002, Vol 242, Num 1-3, pp 1-16, issn 0012-365XArticle

Tight 2-designs and perfect 1-codes in Doob graphsKOOLEN, J. H; MUNEMASA, A.Journal of statistical planning and inference. 2000, Vol 86, Num 2, pp 505-513, issn 0378-3758Article

Distance domination-critical graphsFANG TIAN; XU, Jun-Ming.Applied mathematics letters. 2008, Vol 21, Num 4, pp 416-420, issn 0893-9659, 5 p.Article

A high girth graph constructionSUNIL CHANDRAN, L.SIAM journal on discrete mathematics (Print). 2003, Vol 16, Num 3, pp 366-370, issn 0895-4801, 5 p.Article

An inequality involving the second largest and smallest eigenvalue of a distance-regular graphKOOLEN, Jack H; PARK, Jongyook; YU, Hyonju et al.Linear algebra and its applications. 2011, Vol 434, Num 12, pp 2404-2412, issn 0024-3795, 9 p.Article

The distance-regular graphs such that all of its second largest local eigenvalues are at most oneKOOLEN, Jack H; YU, Hyonju.Linear algebra and its applications. 2011, Vol 435, Num 10, pp 2507-2519, issn 0024-3795, 13 p.Article

  • Page / 8